Learning in Friedberg numberings
نویسندگان
چکیده
منابع مشابه
Learning in Friedberg Numberings
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the recursively enumerable languages, but have simpler grammar equivalence problem compared to acceptable numberings. We show that every explanatorily learnable class can be learnt in some Friedberg numbering. However, such a result does not hold for behaviourally correct learning ...
متن کاملGödel Numberings versus Friedberg Numberings
In [3], Rogers discussed the concept of Gödel numbering. He defined a semi-effective numbering, constructed a semi-lattice of equivalence classes of semi-effective numberings, and showed that all Gödel numberings belong to the unique maximal element of this semi-lattice. In [l], Friedberg gave a recursive enumeration without repetition of the set of partial recursive functions of a single varia...
متن کاملNumberings Optimal for Learning
This paper extends previous studies on learnability in non-acceptable numberings by considering the question: for which criteria which numberings are optimal, that is, for which numberings it holds that one can learn every learnable class using the given numbering as hypothesis space. Furthermore an effective version of optimality is studied as well. It is shown that the effectively optimal num...
متن کاملNumberings and Randomness
We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-Löf random left-computably enumerable reals has a Friedberg numbering, as does the family of all Π 1 classes of positive measure. On the other hand, the Π 1 classes contained in the Martin-Löf random reals do not even have an effective numbering, nor ...
متن کاملIndex Sets and Universal Numberings
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular properties relating to the domain of the corresponding functions are investigated like the set DEQ of all pairs of indices of functions with the same domain, the set DMIN of all minimal indices of sets and DMIN∗ of all in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2008
ISSN: 0890-5401
DOI: 10.1016/j.ic.2008.03.001